Domain Decomposition Algorithms for PDEproblems with Large Scale
نویسندگان
چکیده
We consider a Schur complement BPS-like domain decomposition algorithm for the 2D drift-diiusion equations arising from semiconductor modeling. In particular, we focus on two problems: anisotropic phenomena and large changes in the PDE coeecients as one moves spatial within the domain. The preconditioners that we discuss are essentially BPS preconditioners 2] where the interface coupling is approximated using band matrices generated by the probing technique 3]. To cope with anisotropic phenomena, we introduce additional band matrices (in the context of the probe preconditioner) to approximate the coupling between neighboring interfaces. To address coeecient variations over the domain, we make use of the close connection between domain decomposition and multigrid and introduce specialized interpolation, projection, and averaging techniques to develop an accurate coarse grid approximation. We demonstrate the beneets of the new approach using computational experiments.
منابع مشابه
COMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES
Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملBregmanized Domain Decomposition for Image Restoration
Computational problems of large-scale appearing in biomedical imaging, astronomy, art restoration, and data analysis are gaining recently a lot of attention due to better hardware, higher dimensionality of images and data sets, more parameters to be measured, and an increasing number of data acquired. In the last couple of years non-smooth minimization problems such as total variation minimizat...
متن کاملNovel Algorithms for Ultra Scale Electromagnetic Problems in the Supercomputing Era
The need for increasing fidelity and accuracy in mission-critical electromagnetic applications have pushed the problem sizes toward extreme computational scales. Therefore, there is a large premium placed on the investigation of parallel and scalable integral equation simulators, a particularly useful class of computational electromagnetics, to meet this demand. This dissertation will focus on ...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995